Bimodal Bilattice Logic
نویسنده
چکیده
منابع مشابه
Bilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کاملAlgebraic semantics of logic programs with negation: Characterization of weak interlaced bilattices
We consider fundamental properties of weak interlaced bilattices and give a characterization theorem of them, that is, for any weak interlaced bilattice W there exists a bounded lattice L such that W can be embedded into a typical weak interlaced bilattice K(L). Hence, any interlaced bilattice can be embedded into the weak interlaced bilattice K(L) for some lattice L.
متن کاملMulti-Valued Logic Programming Semantics: An Algebraic Approach
In this paper we introduce the notion of join irreducibility in the context of bilattices and present a procedural semantics for bilattice based logic programs which uses as its basis the join irreducible elements of the knowledge part of the bilattice The join irreducible elements in a bilattice represent the primitive bits of information present within the system In bilattices which have the ...
متن کاملOn Approximation of the Semantic Operators Determined by Bilattice-Based Logic Programs
We introduce the class of bilattice-based annotated logic programs (BAPs). These programs extend the general annotated programs of Kifer and Subrahmanian to the bilattice case. The immediate consequence operator TP is defined for BAPs and its continuity is proven. A theorem of Seda concerning the approximation of the least fixed point of the two-valued TP -operator is generalized to the case of...
متن کاملSound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017